New Method of Image Retrieval Using Fractal Code on the Compression Domain

Image retrieval and indexing techniques are important for efficient management of visual database. Many techniques are generally developed based on the associated compression domain. In the fractal domain, a fractal code is a contractive affine mapping that represents a similarity relation between the range block and the domain block in an image. A new algorithm of IFS fractal code for image retrieval on the compression domain is presented in this paper. First,the inquired image and each image in the database are encoded by Jacquin fractal coding. Second, the image fractal feature vector and the distance of fractal code between two images are defined, and the distance between the inquired image and current image in the database are computed one by one. Finally, the preceding n frame images which are the smallest distance sum of fractal code are taken as the retrieval result. Experimental results show that compared with the direct image pixels similar matching strategy, our scheme shortens the retrieval time of compression domain greatly and guarantees the retrieval accuracy. Our proposed method is effective and feasible. Key-Words: Fractal code; Iterated function system; Image retrieval; Compression domain